Ja n 20 09 One more proof of the Erdős – Turán inequality , and an error estimate in Wigner ’ s law .

نویسندگان

  • Ohad N. Feldheim
  • Sasha Sodin
چکیده

A number of proofs have appeared since then, an especially elegant one given by Ganelius [5]. In most of the proofs, the indicator of A is approximated by its convolution with an appropriate (Fejér-type) kernel. We shall present another proof, based on the arguments developed by Chebyshev, Markov, and Stieltjes to prove the Central Limit Theorem (see Akhiezer [1, Ch. 3]). In this approach, the indicator of A is approximated from above and from below by certain interpolation polynomials. The argument does not use the group structure on T, and thus works in a more general setting.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Rate for the Erdös-Turán Law

The Erdős-Turán law gives a normal approximation for the order of a randomly chosen permutation of n objects. In this paper, we provide a sharp error estimate for the approximation, showing that, if the mean of the approximating normal distribution is slightly adjusted, the error is of order log−1/2n. Combinatorics, Probability and Computing (1994) 3, 167-176 Copyright

متن کامل

Discrepancy estimates for point sets on the s-dimensional Sierpiński carpet

In a recent paper Cristea and Tichy introduced several types of discrepancies of point sets on the s-dimensional Sierpiński carpet and proved various relations between these discrepancies. In the present paper we prove a general lower bound for those discrepancies in terms of N , the cardinality of the point set, and we give a probabilistic proof for the existence of point sets with “small” dis...

متن کامل

Some Exact Ramsey-Turán Numbers

Let r be an integer, f(n) a function, and H a graph. Introduced by Erdős, Hajnal, Sós, and Szemerédi [8], the r-Ramsey-Turán number of H , RTr(n,H, f(n)), is defined to be the maximum number of edges in an n-vertex, H-free graph G with αr(G) ≤ f(n) where αr(G) denotes the Kr-independence number of G. In this note, using isoperimetric properties of the high dimensional unit sphere, we construct ...

متن کامل

Discrepancy estimates on the

In a recent paper Cristea and Tichy introduced several types of discrepancies of point sets on the s-dimensional Sierpiński carpet and proved various relations between these discrepancies. In the present paper we prove a general lower bound for those discrepancies in terms of N , the cardinality of the point set, and we give a probabilistic proof for the existence of point sets with “small” dis...

متن کامل

Wegner estimate and level repulsion for Wigner random matrices

We consider N × N Hermitian random matrices with independent identically distributed entries (Wigner matrices). The matrices are normalized so that the average spacing between consecutive eigenvalues is of order 1/N . Under suitable assumptions on the distribution of the single matrix element, we first prove that, away from the spectral edges, the empirical density of eigenvalues concentrates a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009